Reduced Basis Method for Variational Inequalities in Contact Mechanics
نویسندگان
چکیده
We present an efficient model order reduction method [1] for parametrized elliptic variational inequalities of the first kind: find u ∈ K such that: a(u, v − u;μ) ≥ f(v − u;μ), ∀v ∈ K(μ) where K(μ) := {v ∈ H1(Ω)|Bv ≤ g(μ)}. Motivated by numerous engineering applications that involve contact between elastic body and rigid obstacle, e.g. the obstacle problem [2], we develop a primaldual reduced basis approach to construct offline-online efficient yet certified reduced order models. Such models find application in the real-time or many query context of PDE-constrained optimization, control, or parameter estimation. They can also be easily extended to parabolic systems [3]. Firstly, we develop a primal-dual certified reduced basis method for bijective constraint operator B that provides sharp and inexpensive a posteriori error bounds. We compare both the proposed error bounds and the computational costs with the proposal in [4], demonstrating the quality and effectivity of the approximation and the error bounds. Then, we extend our results to more generalized problems, namely an injective constraint operator B, e.g. for a generalized obstacle problem, or a surjective constraint operator B, e.g. in Signorini’s Problem. We present both a priori and a posteriori analysis for the generalized formulation [2] and the saddle point formulation [5]. Lastly, we discuss the construction and sampling procedure [1] for the given method.
منابع مشابه
Numerical Investigations of an Error Bound for Reduced Basis Approximations of Non-Coercice Variational Inequalities
We consider variational inequalities with different trial and test spaces and a possibly noncoercive bilinear form. Well-posedness has been shown under general conditions that are e.g. valid for the space-time formulation of parabolic variational inequalities. Fine discretizations for such problems resolve in large scale problems and thus in long computing times. To reduce the size of these pro...
متن کاملA Reduced Basis Method for Parametrized Variational Inequalities
Reduced basis methods are an efficient tool for significantly reducing the computational complexity of solving parametrized partial differential equations. Originally introduced for elliptic equations, they have been generalized during the last decade to various types of elliptic, parabolic and hyperbolic systems. In this article, we extend the reduction technique to parametrized variational in...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملRBF-Chebychev direct method for solving variational problems
This paper establishes a direct method for solving variational problems via a set of Radial basis functions (RBFs) with Gauss-Chebyshev collocation centers. The method consist of reducing a variational problem into a mathematical programming problem. The authors use some optimization techniques to solve the reduced problem. Accuracy and stability of the multiquadric, Gaussian and inverse multiq...
متن کامل